منابع مشابه
Covering Arrays on Product Graphs
Two vectors x, y in Zg are qualitatively independent if for all pairs (a, b) ∈ Zg×Zg, there exists i ∈ {1, 2, . . . , n} such that (xi, yi) = (a, b). A covering array on a graph G, denoted by CA(n,G, g), is a |V (G)|×n array on Zg with the property that any two rows which correspond to adjacent vertices in G are qualitatively independent. The number of columns in such array is called its size. ...
متن کاملMixed Covering Arrays on Graphs
We give upper and lower bounds on the size of mixed covering arrays on graphs based on graph homomorphisms. We provide constructions for covering arrays on graphs based on basic graph operations. In particular, we construct optimal mixed covering arrays on trees, cycles and bipartite graphs; the constructed optimal objects have the additional property of being nearly point balanced.
متن کاملCovering Arrays on Graphs: Qualitative Independence Graphs and Extremal Set Partition Theory
There has been a good deal of research on covering arrays over the last 20 years. Most of this work has focused on constructions, applications and generalizations of covering arrays. The main focus of this thesis is a generalization of covering arrays, covering arrays on graphs. The original motivation for this generalization was to improve applications of covering arrays to testing systems and...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2017
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-017-1800-9